divide and conquer algorithm

A improved MASK algorithm by using divide and conquer strategy

基于分治策略的MASK算法的改进

Divide-and-conquer algorithm to generate gray code, 40 mins.

Gray码的分治构造算法40分；

This paper presents a new divide and conquer algorithm for the eigenvalue problem of symmetric tridiagonal matrices.

关于对称三对角矩阵特征值问题，本文提出一种新的分治算法。

As recollected and analysed some classical arithmetic, I ameliorate point by point insertion algorithm and make it unite with divide and conquer delaunay triangulation algorithm, which is become a compositive algorithm which has excellence of constructing rapidly and using small space.

在回顾和分析以往的经典算法的基础上，改进了逐点插入算法并同分治算法相结合形成了一种具有建网快，耗费空间小的合成算法。

Divide-and-conquer algorithm to generate gray code

Gray码的分治构造算法

An Extended Divide and Conquer Algorithm for Solving Real Symmetric Band Generalized Eigenvalue Problem

求解对称带状广义特征值问题的扩展分治算法

Study and Applications of divide and conquer algorithm in spatial overlay analysis

空间叠加分析中的分而治之算法研究与应用

Based on the object oriented data structure of Voronoi diagram for normal curvilinear polygon, an improved Divide and Conquer algorithm is presented in this paper for Voronoi diagram generation called Main Chain Divide and Conquer algorithm.

基于一般曲线多边形Voronoi图的面向对象数据结构，提出了一种改进的Voronoi图生成算法&基链分治算法。

Divide and Conquer Algorithm on the Calendar Problems of the Round Robin

赛程问题分治算法

Research on Selection Problem Divide and Conquer Algorithm

基于分治算法的选择问题研究

Divide-and-conquer method due to the high use of recursive algorithm, the tremendous volume of data, the computer more powerful.

分治算法由于大量使用递归算法，当数据量很大时，对计算机要求较高。